A Formalism for the Classical Sentence-Logic
نویسندگان
چکیده
منابع مشابه
OntoDLP: a Logic Formalism for Knowledge Representation
This paper provides an introduction to knowledge representation using OntoDLP, a formalism which combines the full computational power of Disjunctive Logic Programming (DLP) with suitable abstraction mechanisms for the representation of complex objects and default reasoning. The paper does not provide a formal definition of the language, rather it is intended as an informal presentation of its ...
متن کاملSegment Grammar : a Formalism for Incremental Sentence Generation
Incremental sentence generation imposes special constraints on the representation of the grammar and the design of the formulator (the module which is responsible for constructing the syntactic and morphological structure). In the model of natural speech production presented here, a formalism called Segment Grammar is used for the representation of linguistic knowledge. We give a definition of ...
متن کاملClassical Chinese Sentence Segmentation
Sentence segmentation is a fundamental issue in Classical Chinese language processing. To facilitate reading and processing of the raw Classical Chinese data, we propose a statistical method to split unstructured Classical Chinese text into smaller pieces such as sentences and clauses. The segmenter based on the conditional random field (CRF) model is tested under different tagging schemes and ...
متن کاملLocality for Classical Logic
In this paper we will see deductive systems for classical propositional and predicate logic in the calculus of structures. Like sequent systems, they have a cut rule which is admissible. Unlike sequent systems, they drop the restriction that rules only apply to the main connective of a formula: their rules apply anywhere deeply inside a formula. This allows to observe very clearly the symmetry ...
متن کاملCombinatory Logic and - Calculus for Classical Logic
Since Gri n's work in 1990, classical logic has been an attractive target for extracting computational contents. However, the classical principle used in Gri n's type system is the double-negation-elimination rule, which prevents one to analyze the intuitionistic part and the purely classical part separately. By formulating a calculus with J (for the elimination rule of falsehood) and P (for Pe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nagoya Mathematical Journal
سال: 1966
ISSN: 0027-7630,2152-6842
DOI: 10.1017/s0027763000023941